This report introduces an experimental design that discovers a new relationship between a cell placement for minimized wire crossing in bipartite (two-layer) graphs and a cell placement in linear arrangement, optimized for minimum total wire length as measured after rectilinear routing in a single channel. We introduce hypercrossing, a new crossing model for graphs, and demonstrate that the tot...

\Permission to make digital/hard copy of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for proot or commercial advantage , the copyright notice, the title of the publication and its date appear, and notice is given that copying is by permission of CBL. To copy otherwise, to republish, to post on servers or to redis...

This paper presents a performance-driven I/O pin routing algorithm with special consideration of wire uniformity. First, a topological routing based on min-cost max-flow algorithm is proposed. In this phase, an exponential weight function is used to guide the flow distribution which is very helpful in distributing wires, globally and uniformly, on the whole routing area. Then a physical routing...

The minimization of total wire length is one of the most key issue in VLSI physical design automation, as it reduces the cost of physical wiring required along with the electrical hazards of having long wires in the interconnection, power consumption, and signal propagation delay. So, it is still important as cost as well as high performance issue. The problem of reduced wire length routing sol...

Focus in the present rests on optimization of multi-objective standard cell placement for maximizing the speed and minimizing power and interconnect wire-length with cell-width as a constraint. It incorporates fuzzy cost function rules for designing of multi-objectives to integrate the cost of above defined objectives. A significant improvement is reported when the iterative-constructive standa...

We address the classic wire-length estimation problem and propose a new statistical wire-length estimation approach that captures the probability distribution function of net lengths after placement and before routing. These types of models are highly instrumental in formalizing a complete and consistent probabilistic approach to design automation and design closure where along with optimizing ...

In this paper, we develop a multilevel global placement algorithm (MGP) integrated with fast incremental global routing for directly updating and optimizing congestion cost during physical hierarchy generation. Fast global routing is achieved using a fast two-bend routing and incremental A-tree algorithm. The routing congestion is modeled by the wire usage estimated by the fast global router. A...

Nowadays, bulk of the designers prefer to outsource some parts of their design and fabrication process to the third-part companies due to the reliability problems, manufacturing cost and time-to-market limitations. In this situation, there are a lot of opportunities for malicious alterations by the off-shore companies. In this paper, we proposed a new placement algorithm that hinders the hardwa...

Minimizing the total wire length is an important objective in VLSI layout design. In this paper we consider the problem of minimizing the total wire length during I-dimensional (I-D) compaction. Assume we are given a layout. containing nh horizontal wires, nlJ vertical wires, and rectilinear polygonal layout. components c.omposed of 7lr vertical edges. We present an O(n/, ·nlogn) time algorithm...

Simulated annealing placement algorithms which use minimumwire length metrics based on rectilinear approximations fail to accurately account for an FPGA's routing resources since the number of logic block interconnections could be limited, causing certain placements to rely on resources which may not exist. In this paper we present a simulated annealing-based placement algorithm which performs ...